Semaphore queues: modeling multilayered window flow control mechanisms

نویسندگان

  • Serge Fdida
  • Harry G. Perros
  • Andrzej Wilk
چکیده

We present an open queueing network for analysing multi-layered window flow control mechanisms consisting of different subnetworks. The number of customers in each subnetwork is controlled bya semaphore queue. The queueing network is analysed approximately using decomposition and aggregation. The approximation was validated against exact numerical and simulation data, and it was found to have an acceptable relative error. The queueing model is easy to implement and it can be included in a software package. Using this queueing network, we present a case study involving the modelling and analysis of the ISO X25 flow control mechanism.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling window flow control mechanisms

We present an approximation technique for solving open queueing networks consisting of several su~networks.Each subnetwork models a set of shared resources managed by a semaphore. The 9~euelng n~tworks analyzed have features that are commonly used in Petri Nets, such as, fork and JOIn operations and semaphore queues. This type of queueing network arises naturally when modelling multiple window ...

متن کامل

Flow-controlled Throughput in Distributed Simulators of Feedforward Queueing Networks

Sequential simulation of complex systems can be exceedingly slow and expensive. An obvious means of obtaining faster simulation is to dedicate more resources to it. Distributed Discrete Event Simulation has emerged an important method to study the behaviour of various systems, such as, for example, wireline and wireless networks. In this paper we study the flowcontrolled throughput in the distr...

متن کامل

DIPC: A System Software Solution for Distributed Programming

Distributed Inter-Process Communication (DIPC) provides the programmers of the Linux operating system with distributed programming facilities, including Distributed Shared Memory (DSM). It works by making UNIX System V IPC mechanisms (shared memory, message queues and semaphores) network transparent, thus integrating neatly with the rest of the system. The underlying network protocol used is TC...

متن کامل

Enhancing network performance with TCP rate control

Abstract In TCP (Transmission Control Protocol), congestion control as well as error recovery are implemented by a sliding window. The dynamics of TCP (specifically, a mismatch between the TCP window and the bandwidth-delay product of the network) can sometimes cause the network switches or routers to accumulate large queues, resulting in buffer overflows, reduced throughput, unfairness and und...

متن کامل

The Window Distribution of Multiple TCPs with Random Loss Queues

Two approximate techniques for analyzing the window size distribution of TCP flows sharing a RED-like bottleneck queue are presented. Both methods presented first use a fixed point algorithm to obtain the mean window sizes of the flows, and the mean queue length in the bottleneck buffer. The simpler of the two methods then uses the ‘square root formula’ for TCP; the other method is more complic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 38  شماره 

صفحات  -

تاریخ انتشار 1990